Enhanced cluster computing performance through proportional fairness
نویسندگان
چکیده
منابع مشابه
Enhanced Cluster Computing Performance Through Proportional Fairness
The performance of cluster computing depends on how concurrent jobs share multiple data center resource types like CPU, RAM and disk storage. Recent research has discussed efficiency and fairness requirements and identified a number of desirable scheduling objectives including so-called dominant resource fairness (DRF). We argue here that proportional fairness (PF), long recognized as a desirab...
متن کاملCross-layer Packet-dependant OFDM Scheduling Based on Proportional Fairness
This paper assumes each user has more than one queue, derives a new packet-dependant proportional fairness power allocation pattern based on the sum of weight capacity and the packet’s priority in users’ queues, and proposes 4 new cross-layer packet-dependant OFDM scheduling schemes based on proportional fairness for heterogeneous classes of traffic. Scenario 1, scenario 2 and scenario 3 lead r...
متن کاملTruthfulness, Proportional Fairness, and Efficiency
How does one allocate a collection of resources to a set of strategic agents in a fair and efficient manner without using money? For in many scenarios it is not feasible to use money to compensate agents for otherwise unsatisfactory outcomes. This paper studies this question, looking at both fairness and efficiency measures. • We employ the proportionally fair solution, which is a well-known fa...
متن کاملMeta-heuristic approach to proportional fairness
Proportional fairness is a concept from resource sharing tasks among n users, where each user receives at least 1/n of her or his total value of the infinitely divisible resource. Here we provide an approach to proportional fairness that allows its extension to discrete domains, as well as for the direct application of evolutionary computation to approximate proportional fair states. We employ ...
متن کاملOn the Delay Optimality of Proportional Fairness
We consider connection-level models of resource allocation in the Internet, where files arrive into the network according to a Poisson process and the size of each file is exponentially distributed. For a simple symmetric three-link star network, we derive the optimal resource allocation policy which minimizes the expected number of files waiting in the system. The performance of the optimal po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Performance Evaluation
سال: 2014
ISSN: 0166-5316
DOI: 10.1016/j.peva.2014.07.009